Problem:
 b(b(x1)) -> c(d(x1))
 c(c(x1)) -> d(d(d(x1)))
 c(x1) -> g(x1)
 d(d(x1)) -> c(f(x1))
 d(d(d(x1))) -> g(c(x1))
 f(x1) -> a(g(x1))
 g(x1) -> d(a(b(x1)))
 g(g(x1)) -> b(c(x1))

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {6,5,4,3,2}
   transitions:
    d1(17) -> 18*
    a1(16) -> 17*
    a1(13) -> 14*
    b1(15) -> 16*
    g1(7) -> 8*
    d2(29) -> 30*
    a2(28) -> 29*
    b2(27) -> 28*
    b0(1) -> 2*
    c0(1) -> 3*
    d0(1) -> 4*
    g0(1) -> 6*
    f0(1) -> 5*
    a0(1) -> 1*
    1 -> 15,7
    7 -> 27*
    8 -> 13,3
    14 -> 5*
    18 -> 6*
    30 -> 8,13
  problem:
   
  Qed